________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:27:39
Input Data from:  dataset124.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1245
Average f[i]   :3650
Average g[i,j] :2009,52380952381
Total demand   :11150
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 8
> Selected Move:	1500	1	-1	4	4500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0    >new incumb.: 1500


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 31
> Selected Move:	2790	1	-1	7	10000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  0    >new incumb.: 2790


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	3850	1	-1	6	15000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0    >new incumb.: 3850


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 38
> Selected Move:	4170	1	-1	9	19000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1    >new incumb.: 4170


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 38
> Selected Move:	4110	3	9	3	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 34
> Selected Move:	3690	3	3	5	21500


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 34
> Selected Move:	3770	3	7	9	20000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 38
> Selected Move:	3400	3	1	7	22100


> New Y[]: 
	
	 2  0  4  0  1  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 19
> Selected Move:	3850	2	5	-1	15600


> New Y[]: 
	
	 2  0  4  0  1  0  1  3  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 28
> Selected Move:	3850	4	7	4	16200


> New Y[]: 
	
	 2  0  4  0  3  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 27
> Selected Move:	3850	4	4	6	16400


> New Y[]: 
	
	 2  0  4  0  1  0  3  1  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 26
> Selected Move:	3850	4	6	9	16500


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  0  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 27
> Selected Move:	3670	3	9	3	17400


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 29
> Selected Move:	3670	4	3	4	17700


> New Y[]: 
	
	 2  0  4  1  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 29
> Selected Move:	3670	4	4	6	17900


> New Y[]: 
	
	 2  0  4  1  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 28
> Selected Move:	3670	4	6	7	17100


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 28
> Selected Move:	3585	1	-1	9	21100


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 28
> Selected Move:	3457	4	7	3	21400


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 27
> Selected Move:	3824	3	3	5	21400


> New Y[]: 
	
	 2  0  4  0  1  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 29
> Selected Move:	3532	3	5	8	20800


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 30
> Selected Move:	3500	2	6	-1	15800


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  3  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 30
> Selected Move:	3500	4	8	4	16700


> New Y[]: 
	
	 2  0  4  0  3  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 30
> Selected Move:	3500	4	4	7	16100


> New Y[]: 
	
	 2  0  4  0  1  0  0  3  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 29
> Selected Move:	3500	4	7	9	17000


> New Y[]: 
	
	 2  0  4  0  1  0  0  1  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 28
> Selected Move:	3500	3	9	1	15500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 36
> Selected Move:	3820	1	-1	9	19500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 35
> Selected Move:	3680	3	9	6	20500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  1  0  0  1  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 35
> Selected Move:	3585	3	6	3	21000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 36
> Selected Move:	3310	3	3	5	22000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 35
> Selected Move:	3380	2	8	-1	16500


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 36
> Selected Move:	3390	3	7	6	16000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 37
> Selected Move:	3498	1	-1	3	21500


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 37
> Selected Move:	3370	4	1	3	18400


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 30
> Selected Move:	3390	3	3	9	17500


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 29
> Selected Move:	3390	4	9	4	17200


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 30
> Selected Move:	3482	1	-1	7	22700


> New Y[]: 
	
	 2  0  4  0  3  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,36

## ITERATION 36 #######################


> Neighbours evaluated; 26
> Selected Move:	3468	3	5	3	21700


> New Y[]: 
	
	 2  0  4  1  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,365

## ITERATION 37 #######################


> Neighbours evaluated; 28
> Selected Move:	3387	4	4	6	21900


> New Y[]: 
	
	 2  0  4  1  1  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,37

## ITERATION 38 #######################


> Neighbours evaluated; 27
> Selected Move:	3367	3	3	5	22900


> New Y[]: 
	
	 2  0  4  0  1  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,375

## ITERATION 39 #######################


> Neighbours evaluated; 23
> Selected Move:	3390	2	7	-1	17400


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,38

## ITERATION 40 #######################


> Neighbours evaluated; 28
> Selected Move:	3390	4	6	5	15900


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,385

## ITERATION 41 #######################


> Neighbours evaluated; 27
> Selected Move:	3370	3	9	3	17400


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,38

## ITERATION 42 #######################


> Neighbours evaluated; 29
> Selected Move:	3370	4	5	4	18700


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,375

## ITERATION 43 #######################


> Neighbours evaluated; 28
> Selected Move:	3370	4	4	6	18900


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,37

## ITERATION 44 #######################


> Neighbours evaluated; 27
> Selected Move:	3210	3	3	7	18900


> New Y[]: 
	
	 2  0  4  0  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,365

## ITERATION 45 #######################


> Neighbours evaluated; 26
> Selected Move:	3210	4	6	4	18700


> New Y[]: 
	
	 2  0  4  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,36

## ITERATION 46 #######################


> Neighbours evaluated; 26
> Selected Move:	3210	4	4	5	17400


> New Y[]: 
	
	 2  0  4  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,355

## ITERATION 47 #######################


> Neighbours evaluated; 24
> Selected Move:	3391	1	-1	3	22900


> New Y[]: 
	
	 2  0  4  1  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,35

## ITERATION 48 #######################


> Neighbours evaluated; 29
> Selected Move:	3380	3	5	9	22000


> New Y[]: 
	
	 2  0  4  1  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,345

## ITERATION 49 #######################


> Neighbours evaluated; 25
> Selected Move:	3405	3	3	5	23000


> New Y[]: 
	
	 2  0  4  0  1  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,34

## ITERATION 50 #######################


> Neighbours evaluated; 24
> Selected Move:	3200	4	0	5	18200


> New Y[]: 
	
	 0  0  4  0  1  2  1  1  0  3 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,335

## ITERATION 51 #######################


> Neighbours evaluated; 27
> Selected Move:	3210	3	9	1	16700


> New Y[]: 
	
	 0  3  4  0  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 52 #######################


> Neighbours evaluated; 30
> Selected Move:	3259	1	-1	9	20700


> New Y[]: 
	
	 0  3  4  0  1  2  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,325

## ITERATION 53 #######################


> Neighbours evaluated; 31
> Selected Move:	3200	4	1	4	17900


> New Y[]: 
	
	 0  0  4  0  3  2  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,32

## ITERATION 54 #######################


> Neighbours evaluated; 26
> Selected Move:	3200	4	4	5	18500


> New Y[]: 
	
	 0  0  4  0  2  3  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,315

## ITERATION 55 #######################


> Neighbours evaluated; 26
> Selected Move:	3200	4	4	6	18800


> New Y[]: 
	
	 0  0  4  0  1  3  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,31

## ITERATION 56 #######################


> Neighbours evaluated; 26
> Selected Move:	3200	4	5	6	18100


> New Y[]: 
	
	 0  0  4  0  1  2  3  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,305

## ITERATION 57 #######################


> Neighbours evaluated; 23
> Selected Move:	3200	4	5	4	20000


> New Y[]: 
	
	 0  0  4  0  2  1  3  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,3

## ITERATION 58 #######################


> Neighbours evaluated; 24
> Selected Move:	3200	4	4	7	19300


> New Y[]: 
	
	 0  0  4  0  1  1  3  2  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,295

## ITERATION 59 #######################


> Neighbours evaluated; 23
> Selected Move:	3200	4	6	4	19100


> New Y[]: 
	
	 0  0  4  0  3  1  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,29

## ITERATION 60 #######################


> Neighbours evaluated; 23
> Selected Move:	3200	4	4	5	17800


> New Y[]: 
	
	 0  0  4  0  1  3  1  2  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,285

## ITERATION 61 #######################


> Neighbours evaluated; 23
> Selected Move:	3200	4	5	7	17300


> New Y[]: 
	
	 0  0  4  0  1  2  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,28

## ITERATION 62 #######################


> Neighbours evaluated; 22
> Selected Move:	3200	4	5	4	19200


> New Y[]: 
	
	 0  0  4  0  2  1  1  3  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,275

## ITERATION 63 #######################


> Neighbours evaluated; 21
> Selected Move:	3200	4	4	6	19500


> New Y[]: 
	
	 0  0  4  0  1  1  2  3  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,27

## ITERATION 64 #######################


> Neighbours evaluated; 21
> Selected Move:	3200	4	6	9	19800


> New Y[]: 
	
	 0  0  4  0  1  1  1  3  0  2 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,265

## ITERATION 65 #######################


> Neighbours evaluated; 22
> Selected Move:	3210	3	9	0	18100


> New Y[]: 
	
	 2  0  4  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 66 #######################


> Neighbours evaluated; 22
> Selected Move:	3484	1	-1	3	23600


> New Y[]: 
	
	 2  0  4  1  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 67 #######################


> Neighbours evaluated; 28
> Selected Move:	3426	4	7	3	23900


> New Y[]: 
	
	 2  0  4  3  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 68 #######################


> Neighbours evaluated; 27
> Selected Move:	3370	4	3	4	24200


> New Y[]: 
	
	 2  0  4  1  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 69 #######################


> Neighbours evaluated; 26
> Selected Move:	3342	4	4	6	24400


> New Y[]: 
	
	 2  0  4  1  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 70 #######################


> Neighbours evaluated; 25
> Selected Move:	3300	3	6	1	22000


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 71 #######################


> Neighbours evaluated; 34
> Selected Move:	3395	1	-1	6	27000


> New Y[]: 
	
	 2  3  4  1  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 72 #######################


> Neighbours evaluated; 29
> Selected Move:	3445	3	3	9	25500


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 73 #######################


> Neighbours evaluated; 29
> Selected Move:	3363	2	6	-1	20500


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 74 #######################


> Neighbours evaluated; 32
> Selected Move:	3492	3	1	8	22300


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,265

## ITERATION 75 #######################


> Neighbours evaluated; 30
> Selected Move:	3587	4	8	5	21900


> New Y[]: 
	
	 2  0  4  0  1  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,27

## ITERATION 76 #######################


> Neighbours evaluated; 31
> Selected Move:	3388	4	5	7	22600


> New Y[]: 
	
	 2  0  4  0  1  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,275

## ITERATION 77 #######################


> Neighbours evaluated; 30
> Selected Move:	3578	3	5	6	21100


> New Y[]: 
	
	 2  0  4  0  1  0  1  3  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,28

## ITERATION 78 #######################


> Neighbours evaluated; 28
> Selected Move:	3404	4	7	4	21700


> New Y[]: 
	
	 2  0  4  0  3  0  1  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,285

## ITERATION 79 #######################


> Neighbours evaluated; 28
> Selected Move:	3339	4	4	6	21900


> New Y[]: 
	
	 2  0  4  0  1  0  3  1  1  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,29

## ITERATION 80 #######################


> Neighbours evaluated; 26
> Selected Move:	3300	4	6	9	22000


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  1  3 


> New S[]: 
	
	 0  0  0  0  1  0  0  1  0  1 
 > pw :0,295

## ITERATION 81 #######################


> Neighbours evaluated; 25
> Selected Move:	3058	3	6	5	23500


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,3

## ITERATION 82 #######################


> Neighbours evaluated; 26
> Selected Move:	3200	2	8	-1	18000


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 83 #######################


> Neighbours evaluated; 25
> Selected Move:	3200	4	9	4	17700


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 84 #######################


> Neighbours evaluated; 26
> Selected Move:	3200	4	4	5	16400


> New Y[]: 
	
	 2  0  4  0  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 85 #######################


> Neighbours evaluated; 23
> Selected Move:	3200	4	5	7	17100


> New Y[]: 
	
	 2  0  4  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 86 #######################


> Neighbours evaluated; 22
> Selected Move:	3200	3	2	6	18700


> New Y[]: 
	
	 2  0  0  0  1  1  4  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,325

## ITERATION 87 #######################


> Neighbours evaluated; 29
> Selected Move:	3200	4	6	4	20000


> New Y[]: 
	
	 2  0  0  0  4  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,32

## ITERATION 88 #######################


> Neighbours evaluated; 28
> Selected Move:	3200	4	4	5	17200


> New Y[]: 
	
	 2  0  0  0  1  4  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,315

## ITERATION 89 #######################


> Neighbours evaluated; 27
> Selected Move:	3200	4	5	7	18300


> New Y[]: 
	
	 2  0  0  0  1  3  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,31

## ITERATION 90 #######################


> Neighbours evaluated; 27
> Selected Move:	3200	4	5	4	19600


> New Y[]: 
	
	 2  0  0  0  3  1  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,305

## ITERATION 91 #######################


> Neighbours evaluated; 25
> Selected Move:	3200	4	4	6	19800


> New Y[]: 
	
	 2  0  0  0  1  1  3  4  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,3

## ITERATION 92 #######################


> Neighbours evaluated; 23
> Selected Move:	3200	4	6	9	19900


> New Y[]: 
	
	 2  0  0  0  1  1  1  4  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  1  0  0  0 
 > pw :0,295

## ITERATION 93 #######################


> Neighbours evaluated; 24
> Selected Move:	3210	3	9	1	18400


> New Y[]: 
	
	 2  3  0  0  1  1  1  4  0  0 


> New S[]: 
	
	 1  1  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 94 #######################


> Neighbours evaluated; 33
> Selected Move:	3230	3	5	3	17400


> New Y[]: 
	
	 2  3  0  1  1  0  1  4  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,285

## ITERATION 95 #######################


> Neighbours evaluated; 32
> Selected Move:	3230	4	7	3	17300


> New Y[]: 
	
	 2  3  0  4  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,28

## ITERATION 96 #######################


> Neighbours evaluated; 31
> Selected Move:	3230	4	3	4	18400


> New Y[]: 
	
	 2  3  0  1  4  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,275

## ITERATION 97 #######################


> Neighbours evaluated; 31
> Selected Move:	3230	4	4	6	17100


> New Y[]: 
	
	 2  3  0  1  1  0  4  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,27

## ITERATION 98 #######################


> Neighbours evaluated; 30
> Selected Move:	3300	3	6	2	15500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,265

## ITERATION 99 #######################


> Neighbours evaluated; 32
> Selected Move:	3300	1	-1	9	19500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,26

## ITERATION 100 #######################


> Neighbours evaluated; 33
> Selected Move:	3362	3	1	8	21300


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,255

## ITERATION 101 #######################


> Neighbours evaluated; 29
> Selected Move:	3292	4	8	7	21600


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,25

## ITERATION 102 #######################


> Neighbours evaluated; 29
> Selected Move:	3290	2	9	-1	17600


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,245

## ITERATION 103 #######################


> Neighbours evaluated; 29
> Selected Move:	3290	4	7	3	17900


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,24

## ITERATION 104 #######################


> Neighbours evaluated; 28
> Selected Move:	3290	4	3	4	18200


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,235

## ITERATION 105 #######################


> Neighbours evaluated; 28
> Selected Move:	3290	4	4	8	17300


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,23

## ITERATION 106 #######################


> Neighbours evaluated; 25
> Selected Move:	3216	1	-1	5	23800


> New Y[]: 
	
	 2  0  4  1  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 107 #######################


> Neighbours evaluated; 29
> Selected Move:	3325	4	8	5	23400


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 108 #######################


> Neighbours evaluated; 30
> Selected Move:	3188	4	5	7	24100


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 109 #######################


> Neighbours evaluated; 28
> Selected Move:	3330	3	7	1	22000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 110 #######################


> Neighbours evaluated; 36
> Selected Move:	3405	3	3	9	20500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 111 #######################


> Neighbours evaluated; 35
> Selected Move:	3160	1	-1	7	26000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 112 #######################


> Neighbours evaluated; 30
> Selected Move:	3322	4	1	4	23200


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,245

## ITERATION 113 #######################


> Neighbours evaluated; 26
> Selected Move:	3161	3	5	3	22200


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,25

## ITERATION 114 #######################


> Neighbours evaluated; 27
> Selected Move:	3225	4	4	3	21900


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,255

## ITERATION 115 #######################


> Neighbours evaluated; 26
> Selected Move:	3063	4	3	9	22500


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,26

## ITERATION 116 #######################


> Neighbours evaluated; 24
> Selected Move:	3020	2	8	-1	17000


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,265

## ITERATION 117 #######################


> Neighbours evaluated; 24
> Selected Move:	3090	3	9	5	17900


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 118 #######################


> Neighbours evaluated; 23
> Selected Move:	3090	4	5	3	18900


> New Y[]: 
	
	 2  0  4  3  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,275

## ITERATION 119 #######################


> Neighbours evaluated; 24
> Selected Move:	3090	4	3	4	19200


> New Y[]: 
	
	 2  0  4  1  3  1  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,28

## ITERATION 120 #######################


> Neighbours evaluated; 24
> Selected Move:	3090	4	4	7	18600


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,285

## ITERATION 121 #######################


> Neighbours evaluated; 22
> Selected Move:	3090	3	4	6	19100


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 122 #######################


> Neighbours evaluated; 27
> Selected Move:	3200	3	3	9	17600


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 123 #######################


> Neighbours evaluated; 24
> Selected Move:	3200	4	7	5	16900


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 124 #######################


> Neighbours evaluated; 25
> Selected Move:	3200	4	5	6	18400


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 125 #######################


> Neighbours evaluated; 24
> Selected Move:	3200	4	6	9	18500


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 126 #######################


> Neighbours evaluated; 24
> Selected Move:	3210	3	9	1	17000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 127 #######################


> Neighbours evaluated; 35
> Selected Move:	3235	1	-1	9	21000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 128 #######################


> Neighbours evaluated; 30
> Selected Move:	3230	3	5	3	20000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 129 #######################


> Neighbours evaluated; 36
> Selected Move:	3258	1	-1	4	24500


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,24

## ITERATION 130 #######################


> Neighbours evaluated; 28
> Selected Move:	3230	2	7	-1	19000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 131 #######################


> Neighbours evaluated; 33
> Selected Move:	3451	3	1	5	21400


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 132 #######################


> Neighbours evaluated; 28
> Selected Move:	3243	1	-1	7	26900


> New Y[]: 
	
	 2  0  4  1  1  3  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 133 #######################


> Neighbours evaluated; 27
> Selected Move:	3120	4	5	7	27600


> New Y[]: 
	
	 2  0  4  1  1  1  1  3  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 134 #######################


> Neighbours evaluated; 27
> Selected Move:	3013	4	7	3	27900


> New Y[]: 
	
	 2  0  4  3  1  1  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 135 #######################


> Neighbours evaluated; 26
> Selected Move:	3216	2	7	-1	22400


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 136 #######################


> Neighbours evaluated; 27
> Selected Move:	3132	4	3	4	22700


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 137 #######################


> Neighbours evaluated; 27
> Selected Move:	3070	4	4	6	22900


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 138 #######################


> Neighbours evaluated; 26
> Selected Move:	3030	4	6	9	23000


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 139 #######################


> Neighbours evaluated; 25
> Selected Move:	2950	2	5	-1	16500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  0  3 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 140 #######################


> Neighbours evaluated; 25
> Selected Move:	3230	3	9	1	15000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 141 #######################


> Neighbours evaluated; 31
> Selected Move:	3230	3	0	7	16900


> New Y[]: 
	
	 0  3  4  1  1  0  1  2  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  1  0  0 
 > pw :0,27

## ITERATION 142 #######################


> Neighbours evaluated; 28
> Selected Move:	3230	4	7	3	16700


> New Y[]: 
	
	 0  3  4  2  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  1  0  0 
 > pw :0,275

## ITERATION 143 #######################


> Neighbours evaluated; 26
> Selected Move:	3230	4	3	4	17600


> New Y[]: 
	
	 0  3  4  1  2  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  1  0  0 
 > pw :0,28

## ITERATION 144 #######################


> Neighbours evaluated; 27
> Selected Move:	3230	4	4	6	17900


> New Y[]: 
	
	 0  3  4  1  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  0  1  0  0 
 > pw :0,275

## ITERATION 145 #######################


> Neighbours evaluated; 25
> Selected Move:	3210	3	3	5	18900


> New Y[]: 
	
	 0  3  4  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 146 #######################


> Neighbours evaluated; 28
> Selected Move:	3210	4	6	4	18600


> New Y[]: 
	
	 0  3  4  0  2  1  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 147 #######################


> Neighbours evaluated; 27
> Selected Move:	3210	4	4	7	17900


> New Y[]: 
	
	 0  3  4  0  1  1  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 148 #######################


> Neighbours evaluated; 27
> Selected Move:	3200	3	1	9	19400


> New Y[]: 
	
	 0  0  4  0  1  1  1  2  0  3 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,255

## ITERATION 149 #######################


> Neighbours evaluated; 19
> Selected Move:	3175	4	7	4	20100


> New Y[]: 
	
	 0  0  4  0  2  1  1  1  0  3 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,25

## ITERATION 150 #######################


> Neighbours evaluated; 19
> Selected Move:	3100	4	4	6	20400


> New Y[]: 
	
	 0  0  4  0  1  1  2  1  0  3 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,245

## ITERATION 151 #######################


> Neighbours evaluated; 17
> Selected Move:	3176	4	9	4	20100


> New Y[]: 
	
	 0  0  4  0  3  1  2  1  0  1 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,24

## ITERATION 152 #######################


> Neighbours evaluated; 18
> Selected Move:	3104	4	6	9	20400


> New Y[]: 
	
	 0  0  4  0  3  1  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,235

## ITERATION 153 #######################


> Neighbours evaluated; 18
> Selected Move:	3200	4	4	5	19100


> New Y[]: 
	
	 0  0  4  0  1  3  1  1  0  2 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,23

## ITERATION 154 #######################


> Neighbours evaluated; 20
> Selected Move:	3090	3	9	3	19100


> New Y[]: 
	
	 0  0  4  2  1  3  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,225

## ITERATION 155 #######################


> Neighbours evaluated; 25
> Selected Move:	3090	4	3	4	20000


> New Y[]: 
	
	 0  0  4  1  2  3  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,22

## ITERATION 156 #######################


> Neighbours evaluated; 24
> Selected Move:	3090	4	4	5	19400


> New Y[]: 
	
	 0  0  4  1  3  2  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,215

## ITERATION 157 #######################


> Neighbours evaluated; 24
> Selected Move:	3090	4	4	3	19100


> New Y[]: 
	
	 0  0  4  3  1  2  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,21

## ITERATION 158 #######################


> Neighbours evaluated; 22
> Selected Move:	3090	4	3	6	19600


> New Y[]: 
	
	 0  0  4  1  1  2  3  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,205

## ITERATION 159 #######################


> Neighbours evaluated; 24
> Selected Move:	3090	4	6	7	18800


> New Y[]: 
	
	 0  0  4  1  1  2  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,2

## ITERATION 160 #######################


> Neighbours evaluated; 23
> Selected Move:	3090	4	5	3	19800


> New Y[]: 
	
	 0  0  4  2  1  1  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,195

## ITERATION 161 #######################


> Neighbours evaluated; 24
> Selected Move:	3032	4	3	7	20300


> New Y[]: 
	
	 0  0  4  3  1  1  1  2  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 21
> Selected Move:	3090	4	3	5	19300


> New Y[]: 
	
	 0  0  4  1  1  3  1  2  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,185

## ITERATION 163 #######################


> Neighbours evaluated; 20
> Selected Move:	3035	4	7	6	20300


> New Y[]: 
	
	 0  0  4  1  1  3  2  1  0  0 


> New S[]: 
	
	 0  0  1  0  1  0  1  0  0  0 
 > pw :0,18

## ITERATION 164 #######################


> Neighbours evaluated; 21
> Selected Move:	2960	3	6	8	20000


> New Y[]: 
	
	 0  0  4  1  1  3  0  1  2  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 165 #######################


> Neighbours evaluated; 27
> Selected Move:	2960	4	5	8	19000


> New Y[]: 
	
	 0  0  4  1  1  2  0  1  3  0 


> New S[]: 
	
	 0  0  1  1  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 166 #######################


> Neighbours evaluated; 25
> Selected Move:	2990	1	-1	9	23000


> New Y[]: 
	
	 0  0  4  1  1  2  0  1  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  1  0  0 
 > pw :0,165

## ITERATION 167 #######################


> Neighbours evaluated; 27
> Selected Move:	2960	2	3	-1	17500


> New Y[]: 
	
	 0  0  4  0  1  2  0  1  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  1 
 > pw :0,16

## ITERATION 168 #######################


> Neighbours evaluated; 26
> Selected Move:	2960	4	5	4	19400


> New Y[]: 
	
	 0  0  4  0  2  1  0  1  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  1 
 > pw :0,155

## ITERATION 169 #######################


> Neighbours evaluated; 29
> Selected Move:	2960	4	4	7	18700


> New Y[]: 
	
	 0  0  4  0  1  1  0  2  3  1 


> New S[]: 
	
	 0  0  1  0  1  0  0  0  0  1 
 > pw :0,15

## ITERATION 170 #######################


> Neighbours evaluated; 25
> Selected Move:	3040	3	7	0	16800


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,145

## ITERATION 171 #######################


> Neighbours evaluated; 27
> Selected Move:	3167	1	-1	3	22300


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,14

## ITERATION 172 #######################


> Neighbours evaluated; 29
> Selected Move:	3438	1	-1	7	27800


> New Y[]: 
	
	 2  0  4  1  1  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,135

## ITERATION 173 #######################


> Neighbours evaluated; 26
> Selected Move:	3696	3	8	6	28400


> New Y[]: 
	
	 2  0  4  1  1  1  3  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,13

## ITERATION 174 #######################


> Neighbours evaluated; 23
> Selected Move:	3764	4	6	4	28200


> New Y[]: 
	
	 2  0  4  1  3  1  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,135

## ITERATION 175 #######################


> Neighbours evaluated; 23
> Selected Move:	3683	4	4	9	28500


> New Y[]: 
	
	 2  0  4  1  1  1  1  1  0  3 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,14

## ITERATION 176 #######################


> Neighbours evaluated; 22
> Selected Move:	3280	3	3	8	28500


> New Y[]: 
	
	 2  0  4  0  1  1  1  1  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,145

## ITERATION 177 #######################


> Neighbours evaluated; 27
> Selected Move:	3470	4	9	5	26900


> New Y[]: 
	
	 2  0  4  0  1  3  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,15

## ITERATION 178 #######################


> Neighbours evaluated; 27
> Selected Move:	3525	3	5	1	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,155

## ITERATION 179 #######################


> Neighbours evaluated; 27
> Selected Move:	3430	3	9	3	26000


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,16

## ITERATION 180 #######################


> Neighbours evaluated; 33
> Selected Move:	3610	3	6	5	27500


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,165

## ITERATION 181 #######################


> Neighbours evaluated; 29
> Selected Move:	3364	4	1	3	24400


> New Y[]: 
	
	 2  0  4  3  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 182 #######################


> Neighbours evaluated; 25
> Selected Move:	3291	4	3	4	24700


> New Y[]: 
	
	 2  0  4  1  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 183 #######################


> Neighbours evaluated; 25
> Selected Move:	3255	3	4	1	23000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,18

## ITERATION 184 #######################


> Neighbours evaluated; 35
> Selected Move:	3330	3	8	6	22500


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 185 #######################


> Neighbours evaluated; 30
> Selected Move:	3230	2	5	-1	16000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,19

## ITERATION 186 #######################


> Neighbours evaluated; 31
> Selected Move:	3090	3	1	5	18400


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 187 #######################


> Neighbours evaluated; 23
> Selected Move:	3090	4	5	3	19400


> New Y[]: 
	
	 2  0  4  3  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 188 #######################


> Neighbours evaluated; 23
> Selected Move:	3090	4	3	6	19900


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,205

## ITERATION 189 #######################


> Neighbours evaluated; 23
> Selected Move:	2960	3	6	8	19300


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  3  0 


> New S[]: 
	
	 1  0  1  1  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 190 #######################


> Neighbours evaluated; 28
> Selected Move:	3040	3	7	4	18300


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 191 #######################


> Neighbours evaluated; 25
> Selected Move:	3040	4	8	3	18900


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 192 #######################


> Neighbours evaluated; 27
> Selected Move:	3040	4	3	4	19200


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 193 #######################


> Neighbours evaluated; 26
> Selected Move:	3040	4	4	5	17900


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  1  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 194 #######################


> Neighbours evaluated; 25
> Selected Move:	3139	1	-1	9	21900


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 195 #######################


> Neighbours evaluated; 28
> Selected Move:	3161	3	3	6	21400


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,18

## ITERATION 196 #######################


> Neighbours evaluated; 27
> Selected Move:	3096	4	5	8	21800


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,175

## ITERATION 197 #######################


> Neighbours evaluated; 26
> Selected Move:	3193	1	-1	7	27300


> New Y[]: 
	
	 2  0  4  0  1  1  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,17

## ITERATION 198 #######################


> Neighbours evaluated; 23
> Selected Move:	3178	4	8	7	27600


> New Y[]: 
	
	 2  0  4  0  1  1  1  3  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  1 
 > pw :0,175

## ITERATION 199 #######################


> Neighbours evaluated; 24
> Selected Move:	3113	3	6	3	28100


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,18

## ITERATION 200 #######################


> Neighbours evaluated; 25
> Selected Move:	3198	4	7	5	27400


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  1  0  0 
 > pw :0,185

## ITERATION 201 #######################


> Neighbours evaluated; 24
> Selected Move:	3149	2	8	-1	21900


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 202 #######################


> Neighbours evaluated; 21
> Selected Move:	3044	3	4	6	22400


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 203 #######################


> Neighbours evaluated; 25
> Selected Move:	2935	3	6	8	22900


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  1  0  0 
 > pw :0,2
________________________________________________________________

Best solution found: 4170
Run Termination time: 31.01.2010 10:28:34
Run duration: 00:00:54.2968750
________________________________________________________________
